Model theoretic proofs of the incompleteness theorems

نویسنده

  • Makoto Kikuchi
چکیده

Godel's proofs of the incompleteness theorems are frequently discussed in the context of constructive or nitary viewpoint. Godel showed a concrete independent statement of arithmetic and the proof does not contain any transcendental argument. On the other hand, the completeness theorem asserts that a sentence is not derivable from a theory if and only if there exists a model of the theory which does not satisfy the sentence, and it suggests the existence of model-theoretic proofs of the incompleteness theorems. Nevertheless, as Kreisel states, \as far as, e.g., constructive independence proofs are concerned models are, by the nature of the case, useless." ([Kr2], page 381.)

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gödel incompleteness revisited

We investigate the frontline of Gödel’s incompleteness theorems’ proofs and the links with computability. The Gödel incompleteness phenomenon Gödel’s incompleteness theorems [Göd31, SFKM+86] are milestones in the subject of mathematical logic. Apart from Gödel’s original syntactical proof, many other proofs have been presented. Kreisel’s proof [Kre68] was the first with a model-theoretical flav...

متن کامل

A new version of algorithmic information theory

Algorithmic information theory may be viewed as the result of adding the idea of program-size complexity to recursive function theory. The main application of algorithmic information theory is its informationtheoretic incompleteness theorems. This theory is concerned with the size of programs, but up to now these have never been programs that one could actually program out and run on interestin...

متن کامل

Incompleteness in a General Setting

Full proofs of the Gödel incompleteness theorems are highly intricate affairs. Much of the intricacy lies in the details of setting up and checking the properties of a coding system representing the syntax of an object language (typically, that of arithmetic) within that same language. These details are seldom illuminating and tend to obscure the core of the argument. For this reason a number o...

متن کامل

A Fundamental Flaw in Incompleteness Proofs by Gregory Chaitin

There are several similar proofs published by Chaitin involving the concept of information-theoretic complexity, and Chaitin claims that these are proof of the incompleteness of formal systems. An elementary analysis of these proofs demonstrates that the proofs are not in fact proofs of incompleteness.

متن کامل

Gödel's Incompleteness Theorems

Gödel’s two incompleteness theorems [2] are formalised, following a careful presentation by Świerczkowski [3], in the theory of hereditarily finite sets. This represents the first ever machine-assisted proof of the second incompleteness theorem. Compared with traditional formalisations using Peano arithmetic [1], coding is simpler, with no need to formalise the notion of multiplication (let alo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007